#include <iostream>
#include <windows.h>
#include <stdlib.h>
using namespace std;
const int N=15000;
int b[N][N], a[N], sum[N];
void init(int n)
{
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            b[i][j] = 2;
        }
        a[i] = 1;
    }
}
int main()
{
 long long head, tail, freq; // timers
  similar to CLOCKS_PER_SEC
     init(N);
  QueryPerformanceFrequency((LARGE_INTEGER *) & freq);
  // start time
  QueryPerformanceCounter((LARGE_INTEGER *) & head);
     for (int i = 0; i < N; i++)
         sum[i] = 0.0;
     for (int j = 0; j < N; j++)
         for (int i = 0; i < N; i++)
             sum[i] += b[j][i] * a[j];
 // end time
 QueryPerformanceCounter((LARGE_INTEGER *) & tail);
 cout << "Col:" << (tail - head) * 1000.0 / freq<< "ms" << endl;
   return 0;
 } 
